package com.sxkiler.demo.hard;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import java.util.*;
import com.sxkiler.demo.model.*;

/**
concatenated-words=连接词
<p>给定一个<strong>不含重复</strong>单词的列表，编写一个程序，返回给定单词列表中所有的连接词。</p>

<p>连接词的定义为：一个字符串完全是由至少两个给定数组中的单词组成的。</p>

<p><strong>示例:</strong></p>

<pre>
<strong>输入:</strong> ["cat","cats","catsdogcats","dog","dogcatsdog","hippopotamuses","rat","ratcatdogcat"]

<strong>输出:</strong> ["catsdogcats","dogcatsdog","ratcatdogcat"]

<strong>解释:</strong> "catsdogcats"由"cats", "dog" 和 "cats"组成;
     "dogcatsdog"由"dog", "cats"和"dog"组成;
     "ratcatdogcat"由"rat", "cat", "dog"和"cat"组成。
</pre>

<p><strong>说明:</strong></p>

<ol>
	<li>给定数组的元素总数不超过 <code>10000</code>。</li>
	<li>给定数组中元素的长度总和不超过 <code>600000</code>。</li>
	<li>所有输入字符串只包含小写字母。</li>
	<li>不需要考虑答案输出的顺序。</li>
</ol>

 */
public class findAllConcatenatedWordsInADict {
    

    class Solution {
        public List<String> findAllConcatenatedWordsInADict(String[] param0) {
            return null;
        }
    }

    @Test
    public void test(){
        Solution solution = new Solution();
        /**
        ["cat","cats","catsdogcats","dog","dogcatsdog","hippopotamuses","rat","ratcatdogcat"]
        */
        //int [] num1 = new int[]{1,3};
        //int [] num2 = new int[]{2};
        //Assertions.assertEquals(solution.{{questionName}}(num1,num2),2);
    }
}

